Deterministic search for relational graph matching
نویسندگان
چکیده
منابع مشابه
Deterministic search for relational graph matching
This paper describes a comparative study of various deterministic discrete search-strategies for graph-matching. The framework for our study is provided by the Bayesian consistency measure recently reported by Wilson and Hancock (IEEE PAMI 19 (1997) 634}648; Pattern Recognition 17 (1996) 263}276) and Wilson et al. (Comput. Vision Image Understanding 72 (1998) 20}38') We investigate two classes ...
متن کاملStochastic Attributed Relational Graph Matching for Image Near-Duplicate Detection
Attributed Relational Graph (ARG) is a useful model for representing many real-world relational patterns. Computing the similarity of ARGs is a fundamental problem for ARG based modelling. This report presents a novel stochastic framework for computing the similarity of ARGs, which defines the ARG similarity as the likelihood ratio of the stochastic process that transforms one ARG to the other....
متن کاملGraph-driven Exploration of Relational Databases for Efficient Keyword Search
Keyword-based search is becoming the standard way to access any kind of information and it is considered today an important add-on of relational database management systems. The approaches to keyword search over relational data usually rely on a two-step strategy in which, first, tree-shaped answers are built by connecting tuples matching the given keywords and, then, potential answers are rank...
متن کاملInexact graph matching using genetic search
-This paper describes a framework for performing relational graph matching using genetic search. There are three novel ingredients to the work. Firstly, we cast the optimisation process into a Bayesian framework by exploiting the recently reported global consistency measure of Wilson and Hancock as a fitness measure. The second novel idea is to realise the crossover process at the level of subg...
متن کاملGeneric Search Plans for Matching Advanced Graph Patterns
In the current paper, we present search plans which can guide pattern matching for advanced graph patterns with edge identities, containment constraints, type variables, negative application conditions, attribute conditions, and injectivity constraints. Based on a generic search graph representation, all search plan operations (e.g. checking the existence of an edge, or extending a matching can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 1999
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(98)00152-6